Morse Theory for Filtrations and Efficient Computation of Persistent Homology

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Morse Theory for Filtrations and Efficient Computation of Persistent Homology

We introduce an efficient preprocessing algorithm to reduce the number of cells in a filtered cell complex while preserving its persistent homology groups. The technique is based on an extension of combinatorial Morse theory from complexes to filtrations.

متن کامل

Discrete Morse Theory for Filtrations

Acknowledgements Enumerating all the ways in which I am grateful to Konstantin would essentially double the length of this document, so I'll save all that stuff for my autobiography. But I will note here that he was simultaneously patient, engaged, proactive, and – best of all – ruthlessly determined to refine and sculpt all our vague big-picture ideas into digestible and implementable concrete...

متن کامل

Computing Persistent Homology via Discrete Morse Theory

This report provides theoretical justification for the use of discrete Morse theory for the computation of homology and persistent homology, an overview of the state of the art for the computation of discrete Morse matchings and motivation for an interest in these computations, particularly from the point of view of topological data analysis. Additionally, a new simulated annealing based method...

متن کامل

Matroid Filtrations and Computational Persistent Homology

This technical report introduces a novel approach to efficient computation in homological algebra over fields, with particular emphasis on computing the persistent homology of a filtered topological cell complex. The algorithms here presented rely on a novel relationship between discrete Morse theory, matroid theory, and classical matrix factorizations. We provide background, detail the algorit...

متن کامل

Persistent homology in graph power filtrations

The persistence of homological features in simplicial complex representations of big datasets in R n resulting from Vietoris-Rips or Čech filtrations is commonly used to probe the topological structure of such datasets. In this paper, the notion of homological persistence in simplicial complexes obtained from power filtrations of graphs is introduced. Specifically, the rth complex, r ≥ 1, in su...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete & Computational Geometry

سال: 2013

ISSN: 0179-5376,1432-0444

DOI: 10.1007/s00454-013-9529-6